Vertex Degree of Random Intersection Graph
نویسنده
چکیده
A random intersection graph is constructed by independently assigning a subset of a given set of objects W, to each vertex of the vertex set V of a simple graph G. There is an edge between two vertices of V, iff their respective subsets(in W ,) have at least one common element. The strong threshold for the connectivity between any two arbitrary vertices of vertex set V, is derived. Also we determine the almost sure probability bounds for the vertex degree of a typical vertex of graph G.
منابع مشابه
Degree distribution of a typical vertex in a general random intersection graph
For a general random intersection graph we show an approximation of the vertex degree distribution by a Poisson mixture. key words: intersection graph, random graph, degree distribution
متن کاملOn k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs
Random s-intersection graphs have recently received much interest in a wide range of application areas. Broadly speaking, a random s-intersection graph is constructed by first assigning each vertex a set of items in some random manner, and then putting an undirected edge between all pairs of vertices that share at least s items (the graph is called a random intersection graph when s = 1). A spe...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملDegree Distributions in General Random Intersection Graphs
Random intersection graphs, denoted by G(n,m, p), are introduced in [9, 14] as opposed to classical Erdős-Rényi random graphs. Let us consider a set V with n vertices and another universal set W with m elements. Define a bipartite graph B(n,m, p) with independent vertex sets V and W . Edges between v ∈ V and w ∈ W exist independently with probability p. The random intersection graph G(n,m, p) d...
متن کاملDegree and clustering coefficient in sparse random intersection graphs
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random intersection graph models of Godehardt and Jaworski (2001). For sparse graphs with positive clustering coefficient, we examine statistical dependence between the (local) clustering coefficient and the degree. Our results are mathematically rigorous. They are consistent...
متن کامل